50 research outputs found

    On the super connectivity of Kronecker products of graphs

    Full text link
    In this paper we present the super connectivity of Kronecker product of a general graph and a complete graph.Comment: 8 page

    3-Factor-criticality in double domination edge critical graphs

    Full text link
    A vertex subset SS of a graph GG is a double dominating set of GG if ∣N[v]∩S∣≥2|N[v]\cap S|\geq 2 for each vertex vv of GG, where N[v]N[v] is the set of the vertex vv and vertices adjacent to vv. The double domination number of GG, denoted by γ×2(G)\gamma_{\times 2}(G), is the cardinality of a smallest double dominating set of GG. A graph GG is said to be double domination edge critical if γ×2(G+e)<γ×2(G)\gamma_{\times 2}(G+e)<\gamma_{\times 2}(G) for any edge e∉Ee \notin E. A double domination edge critical graph GG with γ×2(G)=k\gamma_{\times 2}(G)=k is called kk-γ×2(G)\gamma_{\times 2}(G)-critical. A graph GG is rr-factor-critical if G−SG-S has a perfect matching for each set SS of rr vertices in GG. In this paper we show that GG is 3-factor-critical if GG is a 3-connected claw-free 44-γ×2(G)\gamma_{\times 2}(G)-critical graph of odd order with minimum degree at least 4 except a family of graphs.Comment: 14 page

    The k-tuple twin domination in generalized de Bruijn and Kautz networks

    Get PDF
    AbstractGiven a digraph (network) G=(V,A), a vertex u in G is said to out-dominate itself and all vertices v such that the arc (u,v)∈A; similarly, u in-dominates both itself and all vertices w such that the arc (w,u)∈A. A set D of vertices of G is a k-tuple twin dominating set if every vertex of G is out-dominated and in-dominated by at least k vertices in D, respectively. The k-tuple twin domination problem is to determine a minimum k-tuple twin dominating set for a digraph. In this paper we investigate the k-tuple twin domination problem in generalized de Bruijn networks GB(n,d) and generalized Kautz GK(n,d) networks when d divides n. We provide construction methods for constructing minimum k-tuple twin dominating sets in these networks. These results generalize previous results given by Araki [T. Araki, The k-tuple twin domination in de Bruijn and Kautz digraphs, Discrete Mathematics 308 (2008) 6406–6413] for de Bruijn and Kautz networks
    corecore